33 research outputs found

    Comparing the hierarchy of keywords in on-line news portals

    Get PDF
    The tagging of on-line content with informative keywords is a widespread phenomenon from scientific article repositories through blogs to on-line news portals. In most of the cases, the tags on a given item are free words chosen by the authors independently. Therefore, relations among keywords in a collection of news items is unknown. However, in most cases the topics and concepts described by these keywords are forming a latent hierarchy, with the more general topics and categories at the top, and more specialised ones at the bottom. Here we apply a recent, cooccurrence-based tag hierarchy extraction method to sets of keywords obtained from four different on-line news portals. The resulting hierarchies show substantial differences not just in the topics rendered as important (being at the top of the hierarchy) or of less interest (categorised low in the hierarchy), but also in the underlying network structure. This reveals discrepancies between the plausible keyword association frameworks in the studied news portals

    Ranking Network of a Captive Rhesus Macaque Society: A Sophisticated Corporative Kingdom

    Get PDF
    We develop a three-step computing approach to explore a hierarchical ranking network for a society of captive rhesus macaques. The computed network is sufficiently informative to address the question: Is the ranking network for a rhesus macaque society more like a kingdom or a corporation? Our computations are based on a three-step approach. These steps are devised to deal with the tremendous challenges stemming from the transitivity of dominance as a necessary constraint on the ranking relations among all individual macaques, and the very high sampling heterogeneity in the behavioral conflict data. The first step simultaneously infers the ranking potentials among all network members, which requires accommodation of heterogeneous measurement error inherent in behavioral data. Our second step estimates the social rank for all individuals by minimizing the network-wide errors in the ranking potentials. The third step provides a way to compute confidence bounds for selected empirical features in the social ranking. We apply this approach to two sets of conflict data pertaining to two captive societies of adult rhesus macaques. The resultant ranking network for each society is found to be a sophisticated mixture of both a kingdom and a corporation. Also, for validation purposes, we reanalyze conflict data from twenty longhorn sheep and demonstrate that our three-step approach is capable of correctly computing a ranking network by eliminating all ranking error

    Hierarchy measure for complex networks

    Get PDF
    Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges). Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy. Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network. We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. Results for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure.Comment: 29 pages, 9 figures, 4 table

    Social network and dominance hierarchy analyses at Chimpanzee Sanctuary Northwest

    Get PDF
    Different aspects of sociality bear considerable weight on the individual- and group-level welfare of captive nonhuman primates. Social Network Analysis (SNA) is a useful tool for gaining a holistic understanding of the dynamic social relationships of captive primate groups. Gaining a greater understanding of captive chimpanzees through investigations of centrality, preferred and avoided relationships, dominance hierarchy, and social network diagrams can be useful in advising current management practices in sanctuaries and other captive settings. In this study, we investigated the dyadic social relationships, group-level social networks, and dominance hierarchy of seven chimpanzees (Pan troglodytes) at Chimpanzee Sanctuary Northwest. We used focal-animal and instantaneous scan sampling to collect 106.75 total hours of associative, affiliative, and agonistic data from June to September 2016. We analyzed our data using SOCPROG to derive dominance hierarchies and network statistics, and we diagrammed the group\u27s social networks in NetDraw. Three individuals were most central in the grooming network, while two others had little connection. Through agonistic networks, we found that group members reciprocally exhibited agonism, and the group\u27s dominance hierarchy was statistically non-linear. One chimpanzee emerged as the most dominant through agonism but was least connected to other group members across affiliative networks. Our results indicate that the conventional methods used to calculate individuals\u27 dominance rank may be inadequate to wholly depict a group\u27s social relationships in captive sanctuary populations. Our results have an applied component that can aid sanctuary staff in a variety of ways to best ensure the improvement of group welfare

    Social networks in primates: smart and tolerant species have more efficient networks

    Get PDF
    Network optimality has been described in genes, proteins and human communicative networks. In the latter, optimality leads to the efficient transmission of information with a minimum number of connections. Whilst studies show that differences in centrality exist in animal networks with central individuals having higher fitness, network efficiency has never been studied in animal groups. Here we studied 78 groups of primates (24 species). We found that group size and neocortex ratio were correlated with network efficiency. Centralisation (whether several individuals are central in the group) and modularity (how a group is clustered) had opposing effects on network efficiency, showing that tolerant species have more efficient networks. Such network properties affecting individual fitness could be shaped by natural selection. Our results are in accordance with the social brain and cultural intelligence hypotheses, which suggest that the importance of network efficiency and information flow through social learning relates to cognitive abilities

    Single Stock Dynamics on High-Frequency Data: From a Compressed Coding Perspective

    No full text
    High-frequency return, trading volume and transaction number are digitally coded via a nonparametric computing algorithm, called hierarchical factor segmentation (HFS), and then are coupled together to reveal a single stock dynamics without global state-space structural assumptions. The base-8 digital coding sequence, which is capable of revealing contrasting aggregation against sparsity of extreme events, is further compressed into a shortened sequence of state transitions. This compressed digital code sequence vividly demonstrates that the aggregation of large absolute returns is the primary driving force for stimulating both the aggregations of large trading volumes and transaction numbers. The state of system-wise synchrony is manifested with very frequent recurrence in the stock dynamics. And this data-driven dynamic mechanism is seen to correspondingly vary as the global market transiting in and out of contraction-expansion cycles. These results not only elaborate the stock dynamics of interest to a fuller extent, but also contradict some classical theories in finance. Overall this version of stock dynamics is potentially more coherent and realistic, especially when the current financial market is increasingly powered by high-frequency trading via computer algorithms, rather than by individual investors

    Spin-spin coupling information is crucial for unbiased NMR analysis in metabonomics

    No full text
    We address the critical use of spin-spin coupling information for extracting unbiased concentration information of metabolites based on NMR spectroscopy. This coupling information reveals a truncating status due to binning and baseline correction, termed as vertical and horizontal truncations, which are typical operations needed in bin integration for area under spectral peaks. The likelihood function incorporating truncation status of the involved peak areas is analytically derived. We demonstrate that the maximum likelihood estimation (MLE) provides unbiased estimates of metabolite concentrations. When the information of truncation status is neglected, the extent of resultant bias is substantial. These results bear fundamental implications on reliability and validity of most of the popular statistical methodology in metabolomics, including the analysis of variance (ANOVA), principal component analysis (PCA) and multiple testings. For a multiple-response one-way ANOVA, a test statistic is proposed and implemented through a numerical study
    corecore